Interpretable domain adaptation using unsupervised feature selection on pre-trained source models
نویسندگان
چکیده
We study a realistic domain adaptation setting where one has access to an already existing “black-box” machine learning model. Indeed, in real-life scenarios, efficient pre-trained source predictive model is often available and required be preserved. The solution we propose this problem the asset of providing interpretable target transformation by seeking sparse ordered coordinate-wise feature space addition elementary mapping functions. To automatically select subset features adapted, first introduce weakly-supervised process relying on scarce labeled data. Then, address more challenging unsupervised version scenario. end, new pseudo-label estimator over unlabeled examples, which based rank-stability regards prediction. Such estimated “labels” are further used selection assess whether each needs transformed achieve adaptation. provide theoretical foundations our method as well implementation. Numerical experiments real datasets show particularly encouraging results since approaching supervised case, samples.
منابع مشابه
Unsupervised Domain Adaptation with Feature Embeddings
Representation learning is the dominant technique for unsupervised domain adaptation, but existing approaches often require the specification of “pivot features” that generalize across domains, which are selected by task-specific heuristics. We show that a novel but simple feature embedding approach provides better performance, by exploiting the feature template structure common in NLP problems.
متن کاملAdversarial Feature Augmentation for Unsupervised Domain Adaptation
Recent works showed that Generative Adversarial Networks (GANs) can be successfully applied in unsupervised domain adaptation, where, given a labeled source dataset and an unlabeled target dataset, the goal is to train powerful classifiers for the target samples. In particular, it was shown that a GAN objective function can be used to learn target features indistinguishable from the source ones...
متن کاملUnsupervised Multi-Domain Adaptation with Feature Embeddings
Representation learning is the dominant technique for unsupervised domain adaptation, but existing approaches have two major weaknesses. First, they often require the specification of “pivot features” that generalize across domains, which are selected by taskspecific heuristics. We show that a novel but simple feature embedding approach provides better performance, by exploiting the feature tem...
متن کاملUnsupervised Feature Selection Using Feature Similarity
ÐIn this article, we describe an unsupervised feature selection algorithm suitable for data sets, large in both dimension and size. The method is based on measuring similarity between features whereby redundancy therein is removed. This does not need any search and, therefore, is fast. A new feature similarity measure, called maximum information compression index, is introduced. The algorithm i...
متن کاملUnsupervised Feature Selection Using Feature Density Functions
Since dealing with high dimensional data is computationally complex and sometimes even intractable, recently several feature reductions methods have been developed to reduce the dimensionality of the data in order to simplify the calculation analysis in various applications such as text categorization, signal processing, image retrieval, gene expressions and etc. Among feature reduction techniq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2022
ISSN: ['0925-2312', '1872-8286']
DOI: https://doi.org/10.1016/j.neucom.2022.09.031